Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
861	C:/Program Files (x86)/cygwin/home/schmied/Lower Bound TSP SSP'/TECHVER/CATS2013 tech.dvi Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2012-12-14 10:40:44 Complexity classes NP-complete problems Operations research Mathematical optimization Travelling salesman problem Approximation algorithm Optimization problem NP-complete NP Theoretical computer science Computational complexity theory Applied mathematics
862	Fast and Accurate Computation of Binomial Probabilities Catherine Loader July 9, [removed]Introduction Add to Reading List Source URL: projects.scipy.org Language: English - Date: 2009-03-03 10:56:51 Integer sequences Mathematical optimization Complexity classes Poisson distribution Factorial Multiplication algorithm Logarithm P versus NP problem Binomial distribution Mathematics Theoretical computer science Combinatorics
863	A Zapotec contribution towards the typology of inclusory constructions Add to Reading List Source URL: linguistics.berkeley.edu Language: English - Date: 2006-01-15 03:37:34 Zapotec languages Complexity classes Subset Relative clause NP SO Singular they Spanish prepositions Linguistics Applied mathematics Syntax
864	Chapter 7 – General information • CMDh accepted to take over the responsibility for handling/publishing some of the information contained in NtA, Chapter 7 (General information) • Identify sections that will be tak Add to Reading List Source URL: www.hma.eu Language: English - Date: 2011-11-25 05:45:43 Complexity classes Conjectures Mathematical optimization P versus NP problem Structural complexity theory NP Theoretical computer science Mysteries Applied mathematics
865	YUROK TRIBAL COUNCIL AGENDA INFORMATION SHEET Add to Reading List Source URL: www.yuroktribe.org Language: English - Date: 2006-05-30 13:16:35 Complexity classes Weitchpec California NP
866	A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m Add to Reading List Source URL: page.math.tu-berlin.de Language: English Operations research Approximation algorithms Complexity classes Polynomial-time approximation scheme Job shop scheduling Bin packing problem Time complexity Linear programming David Shmoys Theoretical computer science Computational complexity theory Applied mathematics
867	Phase transitions in NP-complete problems: a challenge for probability, combinatorics, and computer science Cristopher Moore University of New Mexico and the Santa Fe Institute Add to Reading List Source URL: tuvalu.santafe.edu Language: English - Date: 2010-10-12 20:57:56 Complexity classes Mathematical optimization NP-complete problems Structural complexity theory NP-complete NP Boolean satisfiability problem P versus NP problem 2-satisfiability Theoretical computer science Computational complexity theory Applied mathematics
868	A Tale of Two Cultures: Phase Transitions in Physics and Computer Science Cristopher Moore University of New Mexico and the Santa Fe Institute Add to Reading List Source URL: tuvalu.santafe.edu Language: English - Date: 2006-12-15 13:47:11 Applied mathematics NP P versus NP problem EXPTIME P Complete Hamiltonian path Co-NP Polynomial-time reduction Theoretical computer science Computational complexity theory Complexity classes
869	jn2004[removed]Complexity: P & NP Goals of this chapter: Given a model of computation and a measure of complexity of computations, it is possible to define the inherent complexity of a class of problems. This is a lowe Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2004-11-18 06:12:14 Complexity classes NP-complete problems Mathematical optimization Boolean algebra NP-complete Boolean satisfiability problem P versus NP problem NP Clique problem Theoretical computer science Computational complexity theory Applied mathematics
870	Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power J¨ urg Nievergelt Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-03-03 14:42:58 Search algorithms Computational complexity theory Complexity classes Combinatorial optimization Algorithm Distributed computing NP Tree traversal Travelling salesman problem Theoretical computer science Applied mathematics Mathematics

UPDATE